Mesh Shape-Quality Optimization Using the Inverse Mean-Ratio Metric: Tetrahedral Proofs
نویسنده
چکیده
This technical report is a companion to [5] that proves the diagonal blocks of the Hessian matrix for the inverse mean-ratio metric for tetrahedral elements are positive definite. Thus, the block Jacobi preconditioner used in the inexact Newton method to solve the mesh shape-quality optimization problem using the average inverse mean-ratio metric for the objective function is positive definite. Note that [5] only proves these results for triangular elements. We first recall the proposition proved in [5] used to show convexity for fractional functions. Definition 1.1 (Uniform Convexity [6]) Let f : < → <, and let Ω ⊆ < be a convex set. The function f is uniformly convex on Ω with constant κ if there exists a constant κ > 0 such that for all x ∈ Ω, y ∈ Ω, and λ ∈ [0, 1],
منابع مشابه
Mesh shape-quality optimization using the inverse mean-ratio metric
Meshes containing elements with bad quality can result in poorly conditioned systems of equations that must be solved when using a discretization method, such as the finite-element method, for solving a partial differential equation. Moreover, such meshes can lead to poor accuracy in the approximate solution computed. In this paper, we present a nonlinear fractional program that relocates the v...
متن کاملA Comparison of Objective Functions of Optimization-based Smoothing Algorithm for Tetrahedral Mesh Improvement
The objective function based on mesh quality metric has a major impact on smoothing unstructured tetrahedral meshes. The ability of seven mesh quality metrics to distinguish four kinds of poor-quality elements and their effects on the change of element shape are analyzed in detail. Then, four better mesh quality metrics are chosen to construct objective functions. In addition, the rational dete...
متن کاملA Comparison of Inexact Newton and Coordinate Descent Mesh Optimization Techniques
We compare inexact Newton and coordinate descent methods for optimizing the quality of a mesh by repositioning the vertices, where quality is measured by the harmonic mean of the mean-ratio metric. The effects of problem size, element size heterogeneity, and various vertex displacement schemes on the performance of these algorithms are assessed for a series of tetrahedral meshes.
متن کاملTetrahedral Element Shape Optimization via the Jacobian Determinant and Condition Number
We present a new shape measure for tetrahedral elements that is optimal in the sense that it gives the distance of a tetrahedron from the set of inverted elements. This measure is constructed from the condition number of the linear transformation between a unit equilateral tetrahedron and any tetrahedron with positive volume. We use this shape measure to formulate two optimization objective fun...
متن کاملQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
The concept of optimal Delaunay triangulation (ODT) and the corresponding error-based quality metric are first introduced. Then one kind of mesh smoothing algorithm for tetrahedral mesh based on the concept of ODT is examined. With regard to its problem of possible producing illegal elements, this paper proposes a modified smoothing scheme with a constrained optimization model for tetrahedral m...
متن کامل